A basic free logic.
نویسندگان
چکیده
منابع مشابه
Basic primal infon logic
Primal infon logic (PIL) was introduced in 2009 in the framework of policy and trust management. In the meantime, some generalizations appeared, and there have been some changes in the syntax of the basic PIL. This paper is on the basic PIL, and one of our purposes is to “institutionalize” the changes. We prove a small-model theorem for the propositional fragment of basic primal infon logic (PP...
متن کاملResiduated Basic Logic I
We study the residuated basic logic (RBL) of residuated basic algebra in which the basic implication of Visser’s basic propositional logic (BPL) is interpreted as the right residual of a non-associative binary operator · (product). We develop an algebraic system SRBL of residuated basic algebra by which we show that RBL is a conservative extension of BPL. We present the sequent formalization LR...
متن کاملA Basic Logic for Textual Inference
This note describes a logical system based on concepts and contexts, the system for textual inference logic. The system is the beginnings of a logic that is a kind of “contexted” description logic, designed to support local linguistic inferences. This logic pays attention to the intensionality of linguistic constructs and to the need for tractability of inference in knowledge representation for...
متن کاملA Basic Logic for Textual Davidsonian Inference
This note describes the basics of a logical system, based on concepts and contexts, whose aim is to serve as a representation language for meanings of natural language sentences in the system that we are developing as part of the Aquaint framework. Some higher level discussion of our system and the rationale behind it can be found in (Crouch 2005; Condoravdi et al. 2003; Crouch et al. 2002). As...
متن کاملA Basic Formal Equational Predicate Logic
We present the details of a formalization of Equational Predicate Logic based on a propositional version of the Leibniz rule (PSL—Propositional Strong Leibniz), EQN (equanimity) and TR (transitivity). All the above rules are “strong”, that is, they are applicable to arbitrary premises (not just to absolute theorems). It is shown that a strong no-capture Leibniz (SLCS—Strong Leibniz with “Contex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1988
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093638018